2

Landmarks in graphs

Year:
1996
Language:
english
File:
PDF, 843 KB
english, 1996
3

Improved Approximation Algorithms for Uniform Connectivity Problems

Year:
1996
Language:
english
File:
PDF, 174 KB
english, 1996
6

Approximation algorithms for finding low-degree subgraphs

Year:
2004
Language:
english
File:
PDF, 180 KB
english, 2004
8

Designing multi-commodity flow trees

Year:
1994
Language:
english
File:
PDF, 587 KB
english, 1994
9

On strongly connected digraphs with bounded cycle length

Year:
1996
Language:
english
File:
PDF, 590 KB
english, 1996
11

Degree-bounded minimum spanning trees

Year:
2009
Language:
english
File:
PDF, 874 KB
english, 2009
12

Survivable network design: the capacitated minimum spanning network problem

Year:
2004
Language:
english
File:
PDF, 193 KB
english, 2004
13

Approximating the k-traveling repairman problem with repairtimes

Year:
2007
Language:
english
File:
PDF, 202 KB
english, 2007
15

Approximating the Minimum Equivalent Digraph

Year:
1995
Language:
english
File:
PDF, 1.72 MB
english, 1995
16

Low-Degree Spanning Trees of Small Weight

Year:
1996
Language:
english
File:
PDF, 1.58 MB
english, 1996
17

Algorithms for Capacitated Vehicle Routing

Year:
2001
Language:
english
File:
PDF, 218 KB
english, 2001
20

Chaining Multiple-Alignment Blocks

Year:
1994
Language:
english
File:
PDF, 1.19 MB
english, 1994
22

PARALLEL EDGE COLORING APPROXIMATION

Year:
1996
Language:
english
File:
PDF, 506 KB
english, 1996
26

Graph and network algorithms

Year:
1996
Language:
english
File:
PDF, 161 KB
english, 1996